Deterministic finite automata learning using counterexample guided abstraction refinement
نویسندگان
چکیده
منابع مشابه
Automata Learning through Counterexample Guided Abstraction Refinement
Abstraction is the key when learning behavioral models of realistic systems. Hence, in most practical applications where automata learning is used to construct models of software components, researchers manually define abstractions which, depending on the history, map a large set of concrete events to a small set of abstract events that can be handled by automata learning tools. In this article...
متن کاملCounterexample-Guided Abstraction Refinement
We present an automatic iterative abstraction-refinement methodology in which the initial abstract model is generated by an automatic analysis of the control structures in the program to be verified. Abstract models may admit erroneous (or “spurious”) counterexamples. We devise new symbolic techniques which analyze such counterexamples and refine the abstract model correspondingly. The refineme...
متن کاملCounterexample-Guided Cartesian Abstraction Refinement
Counterexample-guided abstraction refinement (CEGAR) is a method for incrementally computing abstractions of transition systems. We propose a CEGAR algorithm for computing abstraction heuristics for optimal classical planning. Starting from a coarse abstraction of the planning task, we iteratively compute an optimal abstract solution, check if and why it fails for the concrete planning task and...
متن کاملCounterexample Guided Spotlight Abstraction Refinement
This paper addresses the formal verification of distributed systems comprising a dynamically changing and potentially unbounded number of processes. We employ the spotlight principle to obtain a concise finitary abstraction of the system and devise an abstraction refinement strategy guided by the analysis of abstract counterexamples. It turns out that the key problem for spotlight refinement is...
متن کاملAn Abstraction Refinement Technique for Timed Automata Based on Counterexample-Guided Abstraction Refinement Loop
ion Inputs A , h {h = abstraction function} Ŝ := ∅, →̂ := ∅ {M̂ = (Ŝ, ŝ0, →̂)} foreach l ∈ L do Ŝ := Ŝ ∪ {h(l)} end for ŝ0 := h(l0) foreach (l1, a, g, r, l2) ∈ T do →:=→ ∪{(h(l1), h(l2))} end for return M̂
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific and Technical Journal of Information Technologies, Mechanics and Optics
سال: 2020
ISSN: 2226-1494
DOI: 10.17586/2226-1494-2020-20-3-394-401